A Path Optimization Algorithm for Multiple Unmanned Tractors in Peach Orchard Management

نویسندگان

چکیده

In order to improve the management efficiency of peach orchards, this paper considers cooperative operation scheme multiple unmanned tractors. According actual situation, constructs path planning model tractors in a standard orchard, designs objective function optimize total turning time and operating according tractor driving parameters, solves it by improving differential evolution algorithm. Aiming at premature convergence problem, permutation matrix is introduced represent paths Then, dynamic parameters are adopted make change with number iterations, elite selection strategy used eliminate redundant feasible solutions. An Adaptive Elite Differential Evolution (AEDE) algorithm suitable for multi-tractor optimization proposed. The results show that, compared traditional (Differential Evolution, DE), rectangular orchard optimized AEDE reduced 3.34% 0.87%, respectively. Compared block operation, AEDE-optimized were 37.37% 9.47%, Experiments that AEDE, which optimizes multi-tractors able reduce time.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A path following interior-point algorithm for semidefinite optimization problem based on new kernel function

In this paper, we deal to obtain some new complexity results for solving semidefinite optimization (SDO) problem by interior-point methods (IPMs). We define a new proximity function for the SDO by a new kernel function. Furthermore we formulate an algorithm for a primal dual interior-point method (IPM) for the SDO by using the proximity function and give its complexity analysis, and then we sho...

متن کامل

An Adaptive Path Planning Algorithm for Cooperating Unmanned Air Vehicles

An adaptive path planning algorithm is presented for cooperating Unmanned Air Vehicles (UAVs) that are used to deploy and operate land-based sensor networks. The algorithm employs a global cost function to generate paths for the UAVs, and adapts the paths to exceptions that might occur. Examples are provided of the paths and adaptation.

متن کامل

A hybrid algorithm for the path center problem

Let a graph G = (V;E) be given. In the path center problem we want to find a path P in G such that the maximum weighted distance of P to every vertex in V is minimized. In this paper a genetic algorithm and ahybrid of genetic and ant colony algorithms are presented for the path center problem. Some test problems are examined to compare the algorithms. The results show that for almost all exampl...

متن کامل

A path-following infeasible interior-point algorithm for semidefinite programming

We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT...

متن کامل

Optimal Path Planning Program for Autonomous Speed Sprayer in Orchard Using Order-Picking Algorithm

This study was conducted to develop a software program which computes optimal path for autonomous navigation in orchard, especially for speed sprayer. Possibilities of autonomous navigation in orchard were shown by other researches which have minimized distance error between planned path and performed path. But, research of planning an optimal path for speed sprayer in orchard is hardly founded...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Agronomy

سال: 2022

ISSN: ['2156-3276', '0065-4663']

DOI: https://doi.org/10.3390/agronomy12040856